Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation
نویسندگان
چکیده
A. Saade, F. Krzakala and L. Zdeborová 1 Laboratoire de Physique Statistique, UMR 8550 CNRS, Department of Physics, École Normale Supérieure and PSL Research University, Rue Lhomond, 75005 Paris, France 2 Sorbonne Universités, UPMC Univ Paris 06, UMR 8550, LPS, F-75005, Paris, France 3 ESPCI and CNRS UMR 7083 Gulliver, 10 rue Vauquelin,Paris 75005 4 Institut de Physique Théorique, CEA Saclay and URA 2306, CNRS, 91191 Gif-sur-Yvette, France (Dated: June 12, 2015)
منابع مشابه
Graph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملRank-One Matrix Completion with Automatic Rank Estimation via L1-Norm Regularization
Completing a matrix from a small subset of its entries, i.e., matrix completion, is a challenging problem arising from many real-world applications, such as machine learning and computer vision. One popular approach to solving the matrix completion problem is based on low-rank decomposition/factorization. Low-rank matrix decomposition-based methods often require a pre-specified rank, which is d...
متن کاملRobust Spectral Detection of Global Structures in the Data by Learning a Regularization
Spectral methods are popular in detecting global structures in the given data that can be represented as a matrix. However when the data matrix is sparse or noisy, classic spectral methods usually fail to work, due to localization of eigenvectors (or singular vectors) induced by the sparsity or noise. In this work, we propose a general method to solve the localization problem by learning a regu...
متن کاملOptimal Statistical and Computational Rates for One Bit Matrix Completion
We consider one bit matrix completion under rank constraint. We present an estimator based on rank constrained maximum likelihood estimation, and an e cient greedy algorithm to solve it approximately based on an extension of conditional gradient descent. The output of the proposed algorithm converges at a linear rate to the underlying true low-rank matrix up to the optimal statistical estimatio...
متن کاملMissing Entries Matrix Approximation and Completion
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank approximations, similar algorithms appears recently in the literature under different names. In this work, we introduce new theorems for matrix approximation and show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015